منابع مشابه
On the Minimum Load Coloring Problem
Given a graph G = (V,E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring φ : V → {red, blue} is a pair dφ = (rφ, bφ), where rφ is the number of edges with at least one end-vertex colored red and bφ is the number of edges with at least one end-vertex colored blue. Our aim is to find a coloring φ such that the (maximum) load, lφ := 1 m · max{rφ, bφ}, is mi...
متن کاملThe Probabilistic Minimum Coloring Problem
Nous étudions le problème de coloration probabiliste (PCOLOR) sous une stratégie de modification consistant, pour une solution a priori C, de supprimer les sommets qui son absents de C. Nous calculons la fonction objectif associée avec cette stratégie, donnons des bornes pour sa valeur et caractérisons la complexité algorithmique du calcul de la solution a priori optimal. Nous démontrons que PC...
متن کاملSolving the minimum-weighted coloring problem
Weighted coloring is a generalization of the wellknown vertex (unweighted) coloring for which a number of exact algorithms have been presented in the literature. We are not aware of any optimal method specifically designed for the minimum-weighted coloring problem on arbitrary graphs. Only a few heuristics have been developed with the goal of finding tighter upper bounds for the maximum-weighte...
متن کاملThe Probabilistic Minimum Coloring Problem (Preliminary version)
Nous étudions le problème de coloration probabiliste (PCOLOR) sous une stratégie de modification consistant, pour une solution a priori C , de supprimer les sommets qui son absents de C . Nous calculons la fonction objectif associée avec cette stratégie, donnons des bornes pour sa valeur et caractérisons la complexité algorithmique du calcul de la solution a priori optimal. Nous démontrons que ...
متن کاملParameterized Algorithms for Load Coloring Problem
One way to state the Load Coloring Problem (LCP) is as follows. Let G = (V,E) be graph and let f : V → {red,blue} be a 2-coloring. An edge e ∈ E is called red (blue) if both end-vertices of e are red (blue). For a 2-coloring f , let r′ f and b′f be the number of red and blue edges and let μf (G) = min{r ′ f , b ′ f}. Let μ(G) be the maximum of μf (G) over all 2-colorings. We introduce the param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.09.001